Inferring the Origin of Routing Changes Based on Preferred Path Changes
نویسندگان
چکیده
Previous studies on inferring the origin of routing changes in the Internet are limited to failure events that generate a large number of routing changes. In this paper, we present a novel approach to origin inference of small failure events. Our scheme focuses on routing changes imposed on preferred paths of prefixes and not on transient paths triggered by path exploration. We first infer the preferred path of each prefix and measure the stability of each inter-AS link over this preferred path. The stability is measured based on routing changes of specific prefixes that regularly use the link and are advertised by the AS adjacent to the link. We then correlate the stability of other links over this path and infer the instability boundary as the origin. Our analysis using Oregon RouteViews data and trouble tickets from operational networks shows that our inference scheme can identify the origins of small failure events with very high accuracy.
منابع مشابه
Designing and implementing a Web-based real time routing service for crisis management (a case study for district 11 of Tehran)
Timing framework associated with catastrophes is one of the most important issues in crisis management. In such cases, being immediate has a considerable importance and web based real-time routing service as an important tool has a significant role in relief operations improvement. At this study, a web-based real time routing service based on open source technology has designed for 11th distric...
متن کاملOn the Origins of BGP Path Changes
BGP has been deployed in Internet for more than a decade. However, the events that cause BGP topological changes are not well understood. Although large traces of routing updates seen in BGP operation are collected by RIPE RIS and University of Oregon RouteViews, previous work examines this data set as individual routing updates. This paper describes methods that group routing updates into even...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملImprovement of the mechanism of congestion avoidance in mobile networks
Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density ...
متن کاملImproving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کامل